A New Pseudo-Random Generator Based on Gollmann Cascades of Baker-Register-Machines
نویسندگان
چکیده
In this paper, we present a new pseudo-random sequence generator, constructed by the generalized discrete Baker transformation. This new generator is called Cascaded Baker Register Machine (CBRM), which uses the sensitivity of chaotic behaviour and allows the application of automataand shift-register theory. It is shown that a CBRM has good properties of randomness, such as large periods and high linear complexity. It can provide high cryptographic security with fast encryption speed, and can be realized effectively by both hardware and software.
منابع مشابه
Some Remarks on the Cross Correlation Analysis of Pseudo Random Generators
Siegenthaler has shown how cross-correlation techniques can be applied to identify pseudo random generators consisting of linear feedback shift registers and a scrambling function 171. These techniques may allow to attack one register in such a generator at a time. The original algorithm needs O(R2'N) operations to identify one register. ( r denotes the length of the register examined, R the nu...
متن کاملCryptanalysis of Clock Controlled Shift Registers
Clock control is one of the mechanisms employed to introduce non-linearity into key stream generators built from linear feedback shift registers. The earliest devices were built from stop-and-go registers while the most recent example, the Shrinking Generator proposed in [2], has an irregular clocking scheme where the number of steps between successive outputs is linked to the length of zero-ru...
متن کاملOn the Security of the Gollmann Cascades
The purpose of this paper is to evaluate the security of the Gollmann m-sequence cascades of k stages. We give some theoretical results, which can be utilized to construct the transition matrix T, of the conditional probabilities between the input and output strings of a stage. And then, we describe an attack algorithm for guessing the initial state of the first LFSR with desired reliability, u...
متن کاملProbabilistic Analysis of Cellular Automata Rules and its Application in Pseudo Random Pattern Generation
The present work is an extension of the work that appeared in the article titled “Pseudorandom Pattern Generation by a 4-Neighborhood Cellular Automata (4NCA) using a Probabilistic Analysis”. In this paper we propose a probabilistic analysis based technique for selecting good CA rules that can be used in pseudo random pattern generation. The proposed technique is applied on a CA of neighborhood...
متن کاملHow to Strengthen Pseudo-random Generators by Using Compression
Sequence compression is one of the most promising tools for strengthening pseudo-random generators used in stream ciphers. Indeed, adding compression components can thwart algebraic attacks aimed at LFSR-based stream ciphers. Among such components are the Shrinking Generator and the Self-Shrinking Generator, as well as recent variations on Bit-Search-based decimation. We propose a general model...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005